Lyndon array construction during Burrows–Wheeler inversion
نویسندگان
چکیده
منابع مشابه
Lyndon Array Construction during Burrows-Wheeler Inversion
In this paper we present an algorithm to compute the Lyndon array of a string T of length n as a byproduct of the inversion of the Burrows-Wheeler transform of T . Our algorithm runs in linear time using only a stack in addition to the data structures used for Burrows-Wheeler inversion. We compare our algorithm with two other linear-time algorithms for Lyndon array construction and show that co...
متن کاملLinear Algorithms for Computing the Lyndon Border Array and the Lyndon Suffix Array
We consider the problem of finding repetitive structures and inherent patterns in a given string s of length n over a finite totally ordered alphabet. A border u of a string s is both a prefix and a suffix of s such that u 6= s. The computation of the border array of a string s, namely the borders of each prefix of s, is strongly related to the string matching problem: given a string w, find al...
متن کاملAlgorithms to Compute the Lyndon Array
In the Lyndon array λ = λx[1..n] of a string x = x[1..n], λ[i] is the length of the longest Lyndon word starting at position i of x. The computation of λ has recently become of great interest, since it was shown (Bannai et al., The “Runs” Theorem [2]) that the runs in x are computable in linear time from λx. Here we first describe three algorithms for computing λx that have been suggested in th...
متن کاملSudo-Lyndon
Based on Lyndon words, a new Sudoku-like puzzle is presented and some relative theoretical questions are proposed.
متن کاملConical Systolic Array for Matrix Inversion
Matrices have been used in many analytical and simulation models and numerical solutions. Matrix operations have essential role in many scientific and engineering applications. One of the most time-consuming operations among matrix operations is matrix inversion. Many hardware designs and software algorithms have been proposed to reduce the time of computation. They will be more important for t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2018
ISSN: 1570-8667
DOI: 10.1016/j.jda.2018.08.001